例句與造句

1. This makes tree rotations useful for rebalancing a tree.
2. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
3. In this last case a constant number of tree rotations completes the rebalancing stage of the deletion process.
4. If there are any tree rotations during insertion and deletion, the affected nodes may need updating as well.
5. This allows WAVL trees to perform fewer tree rotations per deletion, in the worst case, than red-black trees.
6. It's difficult to find tree rotation in a sentence. 用tree rotation造句挺難的
7. Tree rotations are used in a number of tree data structures such as AVL trees, red-black trees, splay trees, and treaps.
8. In the "'dynamic optimality "'problem, the tree can be modified at any time, typically by permitting tree rotations.
9. WAVL trees, like red black trees, use only a constant number of tree rotations, and the constant is even better than for red black trees.
10. In AVL trees, each deletion may require a logarithmic number of tree rotation operations, while red black trees have simpler deletion operations that use only a constant number of tree rotations.
11. In AVL trees, each deletion may require a logarithmic number of tree rotation operations, while red black trees have simpler deletion operations that use only a constant number of tree rotations.
12. One way to do this is to first perform a standard binary tree search for the element in question, and then use tree rotations in a specific fashion to bring the element to the top.
13. The information can be updated efficiently since adding a node only affects the counts of its O ( log " n " ) ancestors, and tree rotations only affect the counts of the nodes involved in the rotation.
14. Self-balancing binary trees solve this problem by performing transformations on the tree ( such as tree rotations ) at key insertion times, in order to keep the height proportional to log 2 ( " n " ).
15. Balancing a " k "-d tree requires care because " k "-d trees are sorted in multiple dimensions so the tree rotation technique cannot be used to balance them as this may break the invariant.
16. The tree rotations used in WAVL tree update operations may make changes that would not be permitted in a red black tree, because they would in effect cause the recoloring of large subtrees of the red black tree rather than making color changes only on a single path in the tree.
更多例句：  下一頁